Automated Standard Cell Synthesis using Genetic Algorithms

نویسندگان

  • Anil Bahuman
  • Benjamin Bishop
  • Khaled Rasheed
چکیده

We have demonstrated the possibility of applying a modified genetic algorithm (GADO) to completely automate the design of a cell given only a behavioral description and optimization criteria such as power, area, speed or their combination. GADO maintains a population of potential standard cell designs. The designs are evaluated by (1) internal rules (2) MAGIC for design rule checks and (3) SPICE for correctness. Connections between transistors are encouraged by an influence check, which checks for broken connections and floating I/O nodes. Working inverters with arbitrary label placements are designed by evolution as a proof of concept.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automated Synthesis of Selection Operators in Genetic Algorithms Using Genetic Programming

Genetic algorithms must be fine-tuned in order to achieve the best results. In this study, we have proposed a new hyper-heuristic based on genetic programming for the automated synthesis of a selection operator in genetic algorithms. Black-Box Optimization Benchmarking is used as a training set and as a test set for estimating the generalization ability of a synthesized selection operator. The ...

متن کامل

Automated Synthesis of Generalized Reversible Cascades using Genetic Algorithms

We propose an automated synthesis of Reversible logic (RL) circuits using Darwinian and Lamarckian Genetic Algorithms (GA). Our designs are in a form of cascades of generalized gates which generalize factorized Exclusive-Or-Sum-of-Products (ESOP) circuits. GA can be used to explore the problem space of combinational functions and here it is used to evolve reversible logic circuits. We emphasize...

متن کامل

A New Mathematical Model in Cell Formation Problem with Consideration of Inventory and Backorder: Genetic and Particle Swarm Optimization Algorithms

Cell Formation (CF) is the initial step in the configuration of cell assembling frameworks. This paper proposes a new mathematical model for the CF problem considering aspects of production planning, namely inventory, backorder, and subcontracting. In this paper, for the first time, backorder is considered in cell formation problem. The main objective is to minimize the total fixed and variable...

متن کامل

Formation of manufacturing cell using queuing theory and considering reliability

In this paper, a stochastic cell formation problem is studied using queuing theory framework and considering reliability. Since cell formation problem is NP-Hard, two algorithms based on genetic and modified particle swarm optimization (MPSO) algorithms are developed to solve the problem. For generating initial solutions in these algorithms, a new heuristic method is developed, which always cre...

متن کامل

Designing Stochastic Cell Formation Problem Using Queuing Theory

This paper presents a new nonlinear mathematical model to solve a cell formation problem which assumes that processing time and inter-arrival time of parts are random variables. In this research, cells are defined as a queue system which will be optimized via queuing theory. In this queue system, each machine is assumed as a server and each part as a customer. The grouping of machines and parts...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001